a(x1) → x1
a(b(x1)) → b(c(a(x1)))
b(c(c(x1))) → c(b(a(x1)))
↳ QTRS
↳ DependencyPairsProof
a(x1) → x1
a(b(x1)) → b(c(a(x1)))
b(c(c(x1))) → c(b(a(x1)))
B(c(c(x1))) → A(x1)
A(b(x1)) → B(c(a(x1)))
B(c(c(x1))) → B(a(x1))
A(b(x1)) → A(x1)
a(x1) → x1
a(b(x1)) → b(c(a(x1)))
b(c(c(x1))) → c(b(a(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
B(c(c(x1))) → A(x1)
A(b(x1)) → B(c(a(x1)))
B(c(c(x1))) → B(a(x1))
A(b(x1)) → A(x1)
a(x1) → x1
a(b(x1)) → b(c(a(x1)))
b(c(c(x1))) → c(b(a(x1)))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
A(b(x1)) → B(c(a(x1)))
A(b(x1)) → A(x1)
Used ordering: Polynomial interpretation [25,35]:
B(c(c(x1))) → A(x1)
B(c(c(x1))) → B(a(x1))
The value of delta used in the strict ordering is 1/8.
POL(c(x1)) = x_1
POL(B(x1)) = (2)x_1
POL(a(x1)) = x_1
POL(A(x1)) = (1/2)x_1
POL(b(x1)) = 1/4 + (4)x_1
a(x1) → x1
a(b(x1)) → b(c(a(x1)))
b(c(c(x1))) → c(b(a(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
B(c(c(x1))) → A(x1)
B(c(c(x1))) → B(a(x1))
a(x1) → x1
a(b(x1)) → b(c(a(x1)))
b(c(c(x1))) → c(b(a(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
B(c(c(x1))) → B(a(x1))
a(x1) → x1
a(b(x1)) → b(c(a(x1)))
b(c(c(x1))) → c(b(a(x1)))